Redundant Code-based Masking Revisited

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Inner Product Masking Revisited

Masking is a popular countermeasure against side channel attacks. Many practical works use Boolean masking because of its simplicity, ease of implementation and comparably low performance overhead. Some recent works have explored masking schemes with higher algebraic complexity and have shown that they provide more security than Boolean masking at the cost of higher overheads. In particular, ma...

متن کامل

Fault Masking in Tri-redundant Systems

A tri-redundant version of a system S is a system T that is specified from S as follows. First, system T has the same number of processes and the same topology as system S. Second, each variable x in a process in system S is replaced by three variables x, x′, and x′′ in the corresponding process in system T . Third, the actions in each process in system S are modified before they are added to t...

متن کامل

Low Entropy Masking Schemes, Revisited

Low Entropy Masking Schemes (LEMS) are a recent countermeasure against side-channel attacks. They aim at reducing the randomness requirements of masking schemes under certain (adversarial and implementation) conditions. Previous works have put forward the interest of this approach when such conditions are met. We complement these investigations by analyzing LEMS against adversaries and implemen...

متن کامل

Code Duality Revisited

In 1991 Claus Emmeche and I suggested that ‘the chain of events which sets life apart from non-life.... needs at least two codes: one code for action (behaviour) and one code for memory—the very first of these codes necessarily must be analog and the second very probably must be digital.’ This principle of code-duality played a major role in our initial ideas on biosemiotics. The paper looks ba...

متن کامل

ASIC Design of Butterfly Unit Based on Non-Redundant and Redundant Algorithm

Fast Fourier Transform (FFT) processors employed with pipeline architecture consist of series of Processing Elements (PE) or Butterfly Units (BU). BU or PE of FFT performs multiplication and addition on complex numbers. This paper proposes a single BU to compute radix-2, 8 point FFT in the time domain as well as frequency domain by replacing a series of PEs. This BU comprises of fused floating ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IACR Transactions on Cryptographic Hardware and Embedded Systems

سال: 2020

ISSN: 2569-2925

DOI: 10.46586/tches.v2021.i1.426-450